Discrete Time Gathering of Agents with Bearing Only and Limited Visibility Range Sensors
نویسندگان
چکیده
We analyze a gathering process for a group of mobile robotic agents, identical and indistinguishable, with no memory (oblivious) and no common frame of reference (neither absolute location nor a common orientation). The agents are assumed to have bearing only sensing within a limited visibility range. We prove that such robots can gather to a small disk in the R-plane within a finite expected number of time-steps, implementing a randomized visibility preserving motion law. In addition, we analyze the dynamics of the cluster of agents after gathering, and show that the agent-cluster preforms a random-walk in the plane.
منابع مشابه
Discrete Time Gathering of Agents with Bearing Only and Limited Visibility Sensors
We analyse a gathering process for a group of mobile robotic agents, identical and indistinguishable, with no memory and no common frame of reference (neither absolute location nor a common orientation). The agents are assumed to have bearing only sensing within a limited visibility range. We prove that such robots can gather to a small disk in the R-plane within a finite expected number of tim...
متن کاملBroadcast Control for Swarm of Agents with Bearing Only and Limited Visibility Sensors
We suggest a control mechanism for leading a team of mobile, oblivious, identical and indistinguishable agents in desired directions. The agents are assumed to have a compass, i.e. a common North direction, and bearing only sensing within a limited visibility range, and may receive a direction-control broadcast with some given probability. We prove that, under the suggested control mechanism, t...
متن کاملDecentralized and Cooperative Multi-Sensor Multi-Target Tracking With Asynchronous Bearing Measurements
Bearings only tracking is a challenging issue with many applications in military and commercial areas. In distributed multi-sensor multi-target bearings only tracking, sensors are far from each other, but are exchanging data using telecommunication equipment. In addition to the general benefits of distributed systems, this tracking system has another important advantage: if the sensors are suff...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملChase Your Farthest Neighbour: A simple gathering algorithm for anonymous, oblivious and non-communicating agents
We consider a group of mobile robotic agents, identical and indistinguishable, having no memory (oblivious) and no common frame of reference (neither absolute location nor a common orientation). Furthermore, these agents are assumed to posses only rudimentary sensing and computational capabilities (limited visibility and basic geometric sorting). We prove that, such robots, implementing a ”Chas...
متن کامل